Comparison of an Asynchronous Manchester Carry Chain Adder to a Synchronous Manchester Carry Chain Adder

نویسندگان

  • D. W. Parent
  • W. C. Lin
  • H. Rattanasonti
چکیده

We compare two 16 bit adders based on the Manchester Carry Chain (MCC) circuit topology using the TSMC .25 µm process technology. The first circuit is a synchronous 16 bit adder based on an optimized 4-bit MCC where the carry out of each of the 4-bit MCCs are ripple carried into the next MCC block through an edge sensitive D-Flip Flop. The second circuit is an asynchronous adder, which uses the same optimized four-bit MCC structure as our synchronous design, except the carry out signals are now controlled asynchronously with request acknowledge signals generated with Muller-C elements. The asynchronous design has less average delay and uses less power than the synchronous design at the expense of increased area, and longer design time. We also compare our asynchronous adder design to other 32 bit asynchronous designs by measuring the propagation delay though 5 carries (the average carry length of a 32 bit adder). In order to compare designs that have been designed with different technologies, we attempt to scale the area, delay, and power by using lambda rules and ring oscillator delay and power results available on the MOSIS website. Results show that the MCC based asynchronous adder is approximately two times faster than other adders with approximately the same power dissipation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1.5v, .18u Area Efficient 32 Bit Adder using 4T XOR and Modified Manchester Carry Chain

The increasing demand for low power VLSI can be fulfilled to a great extent by making proper changes in the circuit level and architectural level design. Addition is a fundamental operation, as it is used to implement more complex functions such as subtraction, multiplication, division etc. The Manchester Carry Chain adder design is preferred to other adders, regardless the number of bits becau...

متن کامل

On Fast Carry Select Adders

Abstract -This paper presents an architecture for a high-speed carry select adder with very long bit lengths utilizing a conflict-free bypass scheme. The proposed scheme has almost half the number of transistors and is faster than a conventional carry select adder. A comparative study is also made between the proposed adder and a Manchester carry chain adder which shows that the proposed scheme...

متن کامل

High Speed Multioutput 128bit Carry- Lookahead Adders Using Domino Logic

Addition is the fundamental operation for any VLSI processors or digital signal processing. In this paper focuses on carry -look ahead adders have done research on the design of high-speed, low-area, or low-power adders. Here domino logic is used for implementation and simulation of 128 bit Carrylook ahead adder based HSPICE Tool. In adder circuits propagation delay is the main drawback. To ove...

متن کامل

Near threshold operation of 16-bit adders in 65nm CMOS technology

The main objective of the thesis is to implement different architectures of 16-bit adders such as; Ripple Carry Adder (RCA), Manchester Carry Chain Adder (MCCA) and Kogge Stone Adder (KSA), in 65nm CMOS technology and to study their performance in terms of power, operating frequency and speed at near threshold operating regions. The performance of these adders are evaluated and compared with ea...

متن کامل

Analysis and design of CMOS Manchester adders with variable carry-skip

Carry-skip adders compare favorably with other adders for efficient VLSI implementation. Lehman has shown that carry-skip adders with variable-size blocks are faster than adders with constant size blocks. In 1967, Majerski suggested that multi-level implementation of the variable-size carry-skip adders would provide further improvement in speed. Almost two decades later, Oklobdzija and Barnes d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004